Resultaten visas 1 - 10 / 1760
resultat / per sida
Vilka publikationsuppgifter finns i tjänsten?
Publikationens namn
Upphovspersoner
Publikationskanal
År

Proof Complexity of Cut-Based Tableaux for Boolean Circuit Satisfiability Checking

Järvisalo, Matti
-2004

Computational and proof complexity of partial string avoidability

Referentgranskad
Öppen tillgång
DOI
10.4230/LIPIcs.MFCS.2016.51
Dimitry Itsykson, Alexander Okhotin, Vsevolod Oparin
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)2016

Relating Proof Complexity Measures and Practical Hardness of SAT

Referentgranskad
DOI
10.1007/978-3-642-33558-7_25
Järvisalo, Matti; Matsliah, Arie; Nordström, Jakob; Zivny, Stanislav
Lecture Notes in Computer Science2012

A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis

Referentgranskad
DOI
10.1007/s10878-015-9975-6
Johnsen, Aleck; Kao, Ming Yang; Seki, Shinnosuke
Journal of Combinatorial Optimization2015

From mathematical axioms to mathematical rules of proof:recent developments in proof analysis

Referentgranskad
Öppen tillgång
DOI
10.1098/rsta.2018.0037
Negri, Sara; von Plato, Jan
Proceedings of the Royal Society. A . Mathematical, physical and engineering sciences2019

Undergraduate students’ attitudes towards mathematical proving in an introduction to proof course

Referentgranskad
Öppen tillgång
DOI
10.1007/s10649-023-10239-8
Häsä, Jokke; Westlin, Lín; Rämö, Johanna
Educational studies in mathematics2023

Proof constructions and their evaluations among Finnish prospective teachers

Referentgranskad
Keranto Tapio, Sarenius Vesa-Matti
-2010

The complexity of innovation: An assessment and review of the complexity perspective

Referentgranskad
DOI
10.1108/EJIM-03-2014-0036
Poutanen, Petro Kristian; Soliman, Wael; Ståhle, Pirjo
European journal of innovation management2016

Proof-Theoretic Analysis of the Quantified Argument Calculus

Referentgranskad
Öppen tillgång
DOI
10.1017/S1755020318000114
Pavlović , Edi; Norbert Gratzl
The Review of Symbolic Logic2019

Optimal mining in proof-of-work blockchain protocols

Referentgranskad
Öppen tillgång
DOI
10.1016/j.frl.2022.103610
Soria, Jorge; Moya, Jorge; Mohazab, Amin
Finance research letters2023

Proof Complexity of Cut-Based Tableaux for Boolean Circuit Satisfiability Checking

2004

Computational and proof complexity of partial string avoidability

Referentgranskad
Öppen tillgång
DOI
10.4230/LIPIcs.MFCS.2016.51
2016

Relating Proof Complexity Measures and Practical Hardness of SAT

Referentgranskad
DOI
10.1007/978-3-642-33558-7_25
2012

A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis

Referentgranskad
DOI
10.1007/s10878-015-9975-6
2015

From mathematical axioms to mathematical rules of proof:recent developments in proof analysis

Referentgranskad
Öppen tillgång
DOI
10.1098/rsta.2018.0037
2019

Undergraduate students’ attitudes towards mathematical proving in an introduction to proof course

Referentgranskad
Öppen tillgång
DOI
10.1007/s10649-023-10239-8
2023

Proof constructions and their evaluations among Finnish prospective teachers

Referentgranskad
2010

The complexity of innovation: An assessment and review of the complexity perspective

Referentgranskad
DOI
10.1108/EJIM-03-2014-0036
2016

Proof-Theoretic Analysis of the Quantified Argument Calculus

Referentgranskad
Öppen tillgång
DOI
10.1017/S1755020318000114
2019

Optimal mining in proof-of-work blockchain protocols

Referentgranskad
Öppen tillgång
DOI
10.1016/j.frl.2022.103610
2023